On constrained reliability maximization using active redundancy in coherent systems with non-overlapping subsystems
نویسندگان
چکیده
منابع مشابه
Constrained Reliability Redundancy Optimization of Complex Systems using Genetic Algorithm
The paper presents a Genetic Algorithm (GA) approach for solving constrained reliability redundancy optimization of general systems. The advanced GA technique uses a dynamic adaptive penalty function to consider the infeasible solutions also and guides the search to optimal or near optimal solution. The penalty technique is applied to keep a certain amount of infeasible solutions in each genera...
متن کاملReliability optimization of series-parallel systems with mixed redundancy strategy in subsystems
Traditionally in redundancy allocation problem (RAP), it is assumed that the redundant components are used based on a predefined active or standby strategies. Recently, some studies consider the situation that both active and standby strategies can be used in a specific system. However, these researches assume that the redundancy strategy for each subsystem can be either active or standby and d...
متن کاملReliability Optimization for Complicated Systems with a Choice of Redundancy Strategies (TECHNICAL NOTE)
Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...
متن کاملFiltering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-constrained, interval Newton algorithms behave like a global constraint over the whole n× n system. Also, filtering algorithms issued from constraint programming perform an AC3-like propagation loop, where the constrain...
متن کاملConstrained Maximization of Non-Monotone Submodular Functions
The problem of constrained submodular maximization has long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of nonmonotone submodular maximization is not as well understood: the first approximation algorithms even for unconstrainted maximization were given by Feige et al. [FMV07]. More recently, Lee et al. [LMNS09] ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
سال: 2014
ISSN: 2146-5703,2146-0957
DOI: 10.11121/ijocta.01.2015.00205